Computer-assisted coloring and illuminating based on a region-tree structure
نویسندگان
چکیده
Colorization and illumination are key processes for creating animated cartoons. Computer assisted methods have been incorporated in animation/illustration systems to reduce the artists' workload. This paper presents a new method for illumination and colorization of 2D drawings based on a region- tree representation. Starting from a hand-drawn cartoon, the proposed method extracts geometric and topological information and builds a tree structure, ensuring independence among parts of the drawing, such as curves and regions. Based on this structure and its attributes, a colorization method that propagates through consecutive frames of animation is proposed, combined with an interpolation method that accurately computes a normal mapping for the illumination process. Different operators for curve and region attributes can be applied independently, obtaining different rendering effects.
منابع مشابه
P-106: The Computer-Assisted Vacuolated Sperm Analysis and Zygote Quality
Background: Digital image processing and analysis are used for computer assisted evaluation of sperm morphology. Sperm head morphology has been identified as a characteristic that can be used to predict a male’s semen quality. On the other hand, zygote competence analysis is an importance tool to select embryo(s) for transfer. The aim of the present study is to determine zygote quality resulted...
متن کاملStress Analysis of the Human Ligamentous Lumber Spine-From Computer-Assisted Tomography to Finite Element Analysis
Detailed investigation on biomechanics of a complex structure such as the human lumbar spine requires the use of advanced computer-based technique for both the geometrical reconstruction and the stress analysis. In the present study, the computer-assisted tomography (CAT) and finite element method (FEM) are merged to perform detailed three dimensional nonlinear analysis of the human ligamentous...
متن کاملAutomatic Service Composition Based on Graph Coloring
Web services as independent software components are published on the Internet by service providers and services are then called by users’ request. However, in many cases, no service alone can be found in the service repository that could satisfy the applicant satisfaction. Service composition provides new components by using an interactive model to accelerate the programs. Prior to service comp...
متن کاملA High Performance Parallel IP Lookup Technique Using Distributed Memory Organization and ISCB-Tree Data Structure
The IP Lookup Process is a key bottleneck in routing due to the increase in routing table size, increasing traıc and migration to IPv6 addresses. The IP address lookup involves computation of the Longest Prefix Matching (LPM), which existing solutions such as BSD Radix Tries, scale poorly when traıc in the router increases or when employed for IPv6 address lookups. In this paper, we describe a ...
متن کاملA High Performance Parallel IP Lookup Technique Using Distributed Memory Organization and ISCB-Tree Data Structure
The IP Lookup Process is a key bottleneck in routing due to the increase in routing table size, increasing traıc and migration to IPv6 addresses. The IP address lookup involves computation of the Longest Prefix Matching (LPM), which existing solutions such as BSD Radix Tries, scale poorly when traıc in the router increases or when employed for IPv6 address lookups. In this paper, we describe a ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره 1 شماره
صفحات -
تاریخ انتشار 2012